Counting Paths in VPA Is Complete for #NC 1
نویسندگان
چکیده
منابع مشابه
Integer Nc 1 Is Equal to Boolean Nc 1
We show that the product of n 3 3 matrices of n-bit integers can be computed in P -uniform FNC1. Since this problem is complete [BOC92] for formul in f+; g on n-bit integers, we conclude that \algebraic NC1" on integers is equal to the usual Boolean notion of NC1 functions.
متن کاملCounting paths in digraphs
We begin with some terminology. All digraphs in this paper are finite. For a digraph G, we denote its vertex and edge sets by V (G) and E(G), respectively. Unless otherwise stated, we assume |V (G)| = n. The members of E(G) are ordered pairs of vertices. We use the notation uv to denote an ordered pair of vertices (u, v) (whether or not u and v are adjacent). We only consider digraphs which hav...
متن کاملCounting Paths in Graphs
We give a simple combinatorial proof of a formula that extends a result by Grigorchuk [Gri78a, Gri78b] (rediscovered by Cohen [Coh82]) relating cogrowth and spectral radius of random walks. Our main result is an explicit equation determining the number of ‘bumps’ on paths in a graph: in a d-regular (not necessarily transitive) non-oriented graph let the series G(t) count all paths between two f...
متن کاملInteger Division Is in Nc 1
An NC 1 circuit for division of binary numbers is presented. By results of Beame, Cook and Hoover this also shows that iterated product and powering are in NC 1 , and by a result of Borodin all three operations are in log-space. This settles an open issue in parallel and space bounded arithmetic complexity.
متن کاملCounting consistent phylogenetic trees is #P-complete
Reconstructing phylogenetic trees is a fundamental task in evolutionary biology. Various algorithms exist for this purpose, many of which come under the heading of ‘supertree methods.’ These methods amalgamate a collection P of phylogenetic trees into a single parent tree. In this paper, we show that, in both the rooted and unrooted settings, counting the number of parent trees that preserve al...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Algorithmica
سال: 2011
ISSN: 0178-4617,1432-0541
DOI: 10.1007/s00453-011-9501-x